Channel graphs of bit permutation networks
نویسندگان
چکیده
Channel graphs have been widely used in the study of blocking networks. In this paper, we show that a bit permutation network has a unique channel graph if and only if it is connected, and two connected bit permutation networks are isomorphic if and only if their channel graphs are isomorphic. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
On the tenacity of cycle permutation graph
A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.
متن کاملON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES
A permutation with no fixed points is called a derangement.The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.Let $G$ be a permutation group, a derangementgraph is one with vertex set $G$ and derangement set $mathcal{D}$ as connecting set. In this paper, we determine the spectrum of derangement graphs of order a product of three primes.
متن کاملHigh-speed All- Optical Time Division Multiplexed Node
In future high-speed self-routing photonic networks based on all-optical time division multiplexing (OTDM) it is highly desirable to carry out packet switching, clock recovery and demultplexing in the optical domain in order to avoid the bottleneck due to the optoelectronics conversion. In this paper we propose a self-routing OTDM node structure composed of an all-optical router and demultiplex...
متن کاملF-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملCharacterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
A bit permutation network is an s-stage interconnection network composed of dn−1 d × d crossbar switches in each stage. This class of networks includes most of the multistage interconnection networks. Recently, Chang et al. [Networks 33 (1999), 261–267] showed that an sstage d-nary bit permutation network N with dn inputs (outputs) can be characterized by an (s − 1)-vector (k1, . . . , ks−1), w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 263 شماره
صفحات -
تاریخ انتشار 2001